|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
timestamp.
LuceneIndexService.getLazySearchResultThreshold()
key) so
that the maxNumberOfCachedEntries number of results found with
LuceneIndexService.getNodes(String, Object) are cached for faster consecutive
lookups.
key) so
that the maxNumberOfCachedEntries number of results found with
LuceneReadOnlyIndexService.getNodes(String, Object) are cached for faster consecutive
lookups.
TimelineIndex.getAllNodes(),
TimelineIndex.getAllNodesAfter(long), TimelineIndex.getAllNodesBefore(long) and
TimelineIndex.getAllNodesBetween(long, long) in a single method.
timestamp ordered by
increasing timestamp.
timestamp ordered by
increasing timestamp.
afterTimestamp and before
(exclusive) beforeTimestamp ordered by increasing timestamp.
key.
null if there's no nodes in the timeline.
LuceneIndexService instance which created this
data source.
null if there's no nodes in the timeline.
LuceneIndexService.getNodes(String, Object) will return very fast and all the
reading and fetching of nodes is done lazily before each step in the
iteration of the returned result.
LuceneIndexService.getLazySearchResultThreshold()
Returns the threshold for when a result is considered big enough to skip
cache and be returned as a fully lazy iterator so that
LuceneReadOnlyIndexService.getNodes(String, Object) will return very fast and all the
reading and fetching of nodes is done lazily before each step in the
iteration of the returned result.
key and value.
value is treated as a lucene query,
http://lucene.apache.org/java/2_9_1/queryparsersyntax.html
So if you've indexed node (1) with value "Andy Wachowski" and node (2)
with "Larry Wachowski" you can expect this behaviour if you query for:
"andy" --> (1)
"Andy" --> (1)
"wachowski" --> (1), (2)
"+wachow* +larry" --> (2)
"andy AND larry" -->
"andy OR larry" --> (1), (2)
"larry Wachowski" --> (1), (2)
The default AND/OR behaviour can be changed by overriding
getDefaultQueryOperator(String, Object).
key and value
.
key and value.
LuceneIndexService.getNodes(String, Object)).
LuceneIndexService.getNodes(String, Object), but with sorted result.
LuceneReadOnlyIndexService.getNodes(String, Object), but with sorted result.
timestamp.
LuceneFulltextIndexService.getNodes(String, Object) using exact matching, so that
it for this call behaves like LuceneIndexService.
LuceneIndexService.getNodes(String, Object) using exact
matching.
indexKey
key and
value.
LuceneIndexService.getSingleNode(String, Object) using exact
matching.
indexKey.
node if it has been added to this
timeline.
IndexService.node with key and value.
node with key and value.
Iterator with additional IndexHits.size() and IndexHits.close()
methods on it, used for iterating over index query results.Analyzer for fulltext parsing.
XaDataSource optimized for the LuceneIndexService.LuceneFulltextDataSource.
LuceneFulltextIndexService.LuceneIndexService which indexes the values with fulltext indexing.LuceneFulltextIndexService which treats the value in
getNodes(String, Object) as a Lucene query, given in the
Lucene query syntax.LuceneIndexService.LuceneIndexBatchInserter.IndexService which uses Lucene as backend.LuceneReadOnlyIndexService.LuceneIndexService which is read-only and will throw
ReadOnlyIndexException in
IndexService.index(Node, String, Object) and
IndexService.removeIndex(Node, String, Object).LuceneDataSource.IndexService.index(org.neo4j.graphdb.Node, String, Object) or
IndexService.removeIndex(org.neo4j.graphdb.Node, String, Object)
methods.node.
key.
key is part of, i.e.
LuceneIndexService#formQuery(String, Object)
can be used when getting stuff from inside a transaction.
LuceneIndexService.getNodes(String, Object) will return very fast and all the
reading and fetching of nodes is done lazily before each step in the
iteration of the returned result.
LuceneIndexService.setLazySearchResultThreshold(int)
)
Sets the threshold for when a result is considered big enough to skip
cache and be returned as a fully lazy iterator so that
LuceneReadOnlyIndexService.getNodes(String, Object) will return very fast and all the
reading and fetching of nodes is done lazily before each step in the
iteration of the returned result.
TimelineIndex on top of Neo4j, using
BTree for indexing.
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||